Limitations on the Usage of Noise Resilient Distance Bounding Protocols
نویسندگان
چکیده
Distance bounding protocols can be employed in mutual entity authentication schemes to determine an upper bound on the distance to another entity. As these protocols are conducted over noisy wireless adhoc channels, they should be designed to cope well with substantial bit error rates during the rapid single bit exchanges. This paper investigates the robustness to high bit error rates of two important secure noise resilient distance bounding protocols: the RFID protocol of Hancke and Kuhn (SECURECOMM ’05), and the noise resilient MAD protocol of Singelée and Preneel (ESAS ’07). In order to satisfy the specified design criteria, the bit error rate should not exceed a particular threshold value. The results of our paper help to compare both noise resilient distance bounding protocols in the scenario where they are employed in extremely noisy environments, and assist to choose the appropriate design parameters, such as the minimal required number of fast bit exchanges.
منابع مشابه
Design and Implementation of a Terrorist Fraud Resilient Distance Bounding System
Given the requirements of fast processing and the complexity of RF ranging systems, distance bounding protocols have been challenging to implement so far; only few designs have been proposed and implemented. Currently, the most efficient implementation of distance bounding protocols uses analog processing and enables the prover to receive a message, process it and transmit the reply within 1 ns...
متن کاملDistance Hijacking Attacks on Distance Bounding Protocols – Abstract
Using a distance bounding protocol, a device (the verifier) can securely obtain an upper bound on its distance to another device (the prover) [1]. A number of distance bounding protocols were proposed in recent years, which provide different performance and security guarantees. So far, several distance-bounding protocols were implemented, some using digital processing and short symbols, whereas...
متن کاملOptimal Proximity Proofs
Provably secure distance-bounding is a rising subject, yet an unsettled one; indeed, very few distance-bounding protocols, with formal security proofs, have been proposed. In fact, so far only two protocols, namely SKI (by Boureanu et al.) and FO (by Fischlin and Onete), offer all-encompassing security guaranties, i.e., resistance to distance-fraud, mafia-fraud, and terrorist-fraud. Matters lik...
متن کاملAn RFID Unilateral Distance Bounding Protocol and Analysis Over a Noisy Channel
Abstract form of automatic identification systems used for humans and objects is radio frequency identification (RFID). Fast and almost error-free calculations have led to its wide application in many places. Distance Bounding (DB) protocols verify that the tag is within a certain distance form reader. This process can be done by measuring the round trip time for message exchange. These protoco...
متن کاملA Sociological Study on the Effect of the Facebook for Bounding Social Capital among the Youth
Face book is virtual and cybernetic network which causes an effective force and among the youth. It shows that if the usage of the face book network increases at home the rate of the interaction and the bounding social capital decreases as well. It also indicates that the effect of face book usage among the young people has increased already. Through a questionnaire by a survey method, more tha...
متن کامل